Coset Construction for Subspace Codes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isotropic Constant Dimension Subspace Codes

 In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...

متن کامل

Construction of subspace codes through linkage

A construction is presented that allows to produce subspace codes of long length using subspace codes of shorter length in combination with a rank metric code. The subspace distance of the resulting code, called linkage code, is as good as the minimum subspace distance of the constituent codes. As a special application, the construction of the best known partial spreads is reproduced. Finally, ...

متن کامل

Sphere-bound-achieving coset codes and multilevel coset codes

A simple sphere bound gives the best possible tradeoff between the volume per point of an infinite array and its error probability on an additive white Gaussian noise (AWGN) channel. It is shown that the sphere bound can be approached by a large class of coset codes or multilevel coset codes with multistage decoding, including certain binary lattices. These codes have structure of the kind that...

متن کامل

Coset bounds for algebraic geometric codes

For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A− C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a party A that can recover the secret in an algebraic geometric linear secret sharing scheme with adversary threshold C, and (2) lower bounds for the support A...

متن کامل

Coset Decomposition Method for Decoding Linear Codes

We introduced an application of the decomposition of a group into cosets of a subgroup to the theory of error detecting and correcting codes. The proposed approach is based on the general method for decoding linear codes known as syndrome decoding. Mathematics Subject Classification: 20A05; 20B05; 20B40

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2017

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2017.2753822